The PPT$$^2$$ Conjecture Holds for All Choi-Type Maps
نویسندگان
چکیده
Abstract We prove that the PPT $$^2$$ 2 conjecture holds for linear maps between matrix algebras which are covariant under action of diagonal unitary group. Many salient examples, like Choi-type maps, depolarizing dephasing amplitude damping and mixtures thereof, lie in this class. Our proof relies on a generalization matrix-theoretic notion factor width pairwise completely positive matrices, complete characterization case two.
منابع مشابه
Some Surfaces of General Type for Which Bloch’s Conjecture Holds
We give many examples of surfaces of general type with pg = 0 for which Bloch’s conjecture holds, for all values of K2 6= 9. Our surfaces are equipped with an involution. Let S be a smooth complex projective surface with pg(S) = 0. Bloch’s conjecture states that the Albanese map A0(S)0 → Alb(S) is an isomorphism, where A0(S)0 is the Chow group of 0-cycles of degree 0 on S. It is known for all s...
متن کاملThe Komlos Conjecture Holds for Vector Colorings
The Komlós conjecture in discrepancy theory states that for some constant K and for any m× n matrix A whose columns lie in the unit ball there exists a vector x ∈ {−1,+1} such that ‖Ax‖∞ ≤ K. This conjecture also implies the Beck-Fiala conjecture on the discrepancy of bounded degree hypergraphs. Here we prove a natural relaxation of the Komlós conjecture: if the columns of A are assigned unit v...
متن کاملThe Hoàng-Reed Conjecture holds for tournaments
Hoàng-Reed conjecture asserts that every digraph D has a collection C of circuits C1, . . . , Cδ+ , where δ is the minimum outdegree of D, such that the circuits of C have a forest-like structure. Formally, |V (Ci) ∩ (V (C1) ∪ . . . ∪ V (Ci−1))| ≤ 1, for all i = 2, . . . , δ. We verify this conjecture for the class of tournaments.
متن کاملThe union-closed sets conjecture almost holds for almost all random bipartite graphs
Frankl’s union-closed sets conjecture states that in every finite unionclosed family of sets, not all empty, there is an element in the ground set contained in at least half of the sets. The conjecture has an equivalent formulation in terms of graphs: In every bipartite graph with least one edge, both colour classes contain a vertex belonging to at most half of the maximal stable sets. We prove...
متن کاملDejean's conjecture holds for n>=30
We extend Carpi’s results by showing that Dejean’s conjecture holds for n ≥ 30. The following definitions are from sections 8 and 9 of [1]: Fix n ≥ 30. Let m = ⌊(n− 3)/6⌋. Let Am = {1, 2, . . . , m}. Let ker ψ = {v ∈ A ∗ m|∀a ∈ Am, 4 divides |v|a}. (In fact, this is not Carpi’s definition of ker ψ, but rather the assertion of his Lemma 9.1.) A word v ∈ A+m is a ψ-kernel repetition if it has per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Henri Poincaré
سال: 2022
ISSN: ['1424-0661', '1424-0637']
DOI: https://doi.org/10.1007/s00023-022-01166-0